NTRU over rings beyond \mathbbZ{\mathbb{Z}}
نویسندگان
چکیده
The NTRU cryptosystem is constructed on the base ring Z. We give suitability conditions on rings to serve as alternate base rings. We present an example of an NTRU-like cryptosystem based on the Eisenstein integers Z[ζ3], which has a denser lattice structure than Z for the same dimension, and which furthermore presents a more difficult lattice problem for lattice attacks, for the same level of decryption failure security.
منابع مشابه
Extensions of Regular Rings
Let $R$ be an associative ring with identity. An element $x in R$ is called $mathbb{Z}G$-regular (resp. strongly $mathbb{Z}G$-regular) if there exist $g in G$, $n in mathbb{Z}$ and $r in R$ such that $x^{ng}=x^{ng}rx^{ng}$ (resp. $x^{ng}=x^{(n+1)g}$). A ring $R$ is called $mathbb{Z}G$-regular (resp. strongly $mathbb{Z}G$-regular) if every element of $R$ is $mathbb{Z}G$-regular (resp. strongly $...
متن کاملETRU: NTRU over the Eisenstein integers
NTRU is a public-key cryptosystem based on polynomial rings over Z. Replacing Z with the ring of Eisenstein integers yields ETRU. We prove through both theory and implementation that ETRU is faster and has smaller keys for the same or better level of security than does NTRU.
متن کاملSome results of linear codes over the ring $\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$
Abstract: In this paper, we mainly study the theory of linear codes over the ring R = Z4 + uZ4 + vZ4 + uvZ4. By the Chinese Remainder Theorem, we have R is isomorphic to the direct sum of four rings Z4. We define a Gray map Φ from R n to Z 4 , which is a distance preserving map. The Gray image of a cyclic code over R is a linear code over Z4. Furthermore, we study the MacWilliams identities of ...
متن کاملOn $\mathbb{Z}G$-clean rings
Let $R$ be an associative ring with unity. An element $x \in R$ is called $\mathbb{Z}G$-clean if $x=e+r$, where $e$ is an idempotent and $r$ is a $\mathbb{Z}G$-regular element in $R$. A ring $R$ is called $\mathbb{Z}G$-clean if every element of $R$ is $\mathbb{Z}G$-clean. In this paper, we show that in an abelian $\mathbb{Z}G$-regular ring $R$, the $Nil(R)$ is a two-sided ideal of $R$ and $\fra...
متن کاملPairTRU: Pairwise Non-commutative Extension of The NTRU Public key Cryptosystem
We show a novel lattice-based scheme (PairTRU) which is a non-commutative variant of the NTRU. The original NTRU is defined via the ring of quotient with variable in integers and this system works in the ring R = Z[x] . We extend this system over Z× Z and it performs all of operations in the non-commutative ring M = M(k,Z×Z)[x] <(Ik×k,Ik×k)x−(Ik×k,Ik×k)> , where M is a matrix ring of k ×...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 56 شماره
صفحات -
تاریخ انتشار 2010